Proposal for Two Enhanced NTRU

Cryptanalysis of NTRU with two Public Keys

NTRU is a fast public key cryptosystem presented in 1996 by Hoffstein, Pipher and Silverman. It operates in the ring of truncated polynomials. In NTRU, a public key is a polynomial defined by the combination of two private polynomials. In this paper, we consider NTRU with two different public keys defined by different private keys. We present a lattice-based attack to recover the private keys a...

A proposal for the unification of two cyanobacterial strains of Nostoc as the same species

The present research aimed to investigate through a polyphasic approach, the differences in morphological and genotypic features of two cyanobacterial strains isolated from paddy fields of northern parts of Iran, belonging to the family Nostocaceae (subsect. IV. I). Based on the reliable identification keys, the two strains were identified as Nostoc ellipsosporum (Desm.) Rabenh. ex Born. et Fla...

Title: Enhanced Encoding and Verification Methods for the Ntru Signature Scheme Section 1. the Hard Problem Underlying Ntru and Nss

The NTRU Signature Scheme (NSS) is a digital signature scheme based on a hard lattice problem. This lattice problem also underlies the NTRU Public Key Cryptosystem described in [1]. In this section we remind the reader of the standard description of the NTRU lattice problem in terms of products of polynomials in convolution rings. For further details, see [1]. Fix three positive integer paramet...

Ntru

Optimizations for NTRU

In this note we describe a variety of methods that may be used to increase the speed and efficiency of the NTRU public key cryptosystem. 1991 Mathematics Subject Classification: 94A60, 11T71. 1. An Overview of NTRU The NTRU Public Key Cryptosystem is based on ring theory and relies for its security on the difficulty of solving certain lattice problems. In this section we will briefly review the...